Simple LPO Constraint Solving Methods

نویسنده

  • Robert Nieuwenhuis
چکیده

We present simple techniques for deciding the satissability of lexicographic path ordering constraints under two diierent semantics: solutions built over the given signature and solutions in extended signatures. For both cases we give the rst NP algorithms, which is optimal as we prove the problems to be NP-complete. We discuss the eecient applicability of the techniques in practice, where, as far as we know, their simply exponential bound improves upon the existing methods, and describe some optimizations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Gpo Ordering Constraints with a Shared Term Data Structure

We present here an algorithm for proving termination of term rewriting systems by gpo ordering constraint solving. Constraint solving is done eeciently thanks to an original shared term data structure based on SOUR graphs. We show how the algorithm works for proving termination of self-embedding rules like ffx ! fgfx. For particular cases of gpo like lpo, the algorithm is fully automatic. We gi...

متن کامل

Solved Forms for Path Ordering

A usual technique in symbolic constraint solving is to apply transformation rules until a solved form is reached for which the problem becomes simple. Ordering constraints are well-known to be reducible to (a disjunction of) solved forms, but unfortunately no polynomial algorithm deciding the satissability of these solved forms is known. Here we deal with a diierent notion of solved form, where...

متن کامل

A new ordering constraint solving method and its applications

We show that it is possible to transform any given LPO ordering constraint C into a finite equivalent set of constraints S for which a special kind of solutions can be obtained. This allows to compute the equalities that follow from ordering constraints, and to decide e.g. whether an ordering constrained equation is a tautology. Another application we develop here is a method to check ordered r...

متن کامل

An introduction to interval-based constraint processing

Constraint programming is often associated with solving problems over finite domains. Many applications in engineering, CAD and design, however, require solving problems over continuous (real-valued) domains. While simple constraint solvers can solve linear constraints with the inaccuracy of floating-point arithmetic, methods based on interval arithmetic allow exact (interval) solutions over a ...

متن کامل

Solved Forms for Path Ordering Constraints

A usual technique in symbolic constraint solving is to apply transformation rules until a solved form is reached for which the problem becomes trivial. Ordering constraints are well-known to be reducible to a disjunction of solved forms, but unfortunately no polynomial algorithm deciding the satissability of these solved forms is known. Surprisingly, it turns out that this is no longer the case...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 47  شماره 

صفحات  -

تاریخ انتشار 1993